Conditional Classification Trees Using Instrumental Variables

نویسندگان

  • Valerio A. Tutore
  • Roberta Siciliano
  • Massimo Aria
چکیده

The framework of this paper is supervised learning using classification trees. Two types of variables play a role in the definition of the classification rule, namely a response variable and a set of predictors. The tree classifier is built up by a recursive partitioning of the prediction space such to provide internally homogeneous groups of objects with respect to the response classes. In the following, we consider the role played by an instrumental variable to stratify either the variables or the objects. This yields to introduce a tree-based methodology for conditional classification. Two special cases will be discussed to grow multiple discriminant trees and partial predictability trees. These approaches use discriminant analysis and predictability measures respectively. Empirical evidence of their usefulness will be shown in real case studies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of classification trees-J48 to model the presence of roach (Rutilus rutilus) in rivers

In the present study, classification trees (CTs-J48 algorithm) were used to study the occurrence of roach in rivers in Flanders (Belgium). The presence/absence of roach was modelled based on a set of river characteristics. The predictive performance of the CTs models was assessed based on the percentage of Correctly Classified Instances (CCI) and Cohen's kappa statistics. To find the best model...

متن کامل

Polynomials for classification trees and applications

This paper relates computational commutative algebra to tree classification with binary covariates. With a single classification variable, properties of uniqueness of a tree polynomial are established. In a binary multivariate context, it is shown how trees for many response variables can be made into a single ideal of polynomials for computations. Finally, a new sequential algorithm is propose...

متن کامل

party: A Laboratory for Recursive Partytioning

The party package (Hothorn, Hornik, and Zeileis 2006) aims at providing a recursive part(y)itioning laboratory assembling various highand low-level tools for building tree-based regression and classification models. This includes conditional inference trees (ctree), conditional inference forests (cforest) and parametric model trees (mob). At the core of the package is ctree, an implementation o...

متن کامل

Mass Assignment Based Induction of Decision Trees on Words

A mass assignment based ID3 algorithm for the induction of decision trees on words is described. Such decision trees encode sets of qualified conditional rules on linguistic variables. The potential of this algorithm is illustrated by means of several examples relating to both real world and model classification and prediction problems.

متن کامل

Use of classification tree methods to study the habitat requirements of tench (Tinca tinca) (L., 1758)

Classification trees (J48) were induced to predict the habitat requirements of tench (Tinca tinca). 306 datasets were used for the given fish during 8 years in the river basins in Flanders (Belgium). The input variables consisted of the structural-habitat (width, depth, gradient slope and distance from the source) and physic chemical (pH, dissolved oxygen, water temperature and electric conduct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007